The Green-tao Theorem: an Exposition
نویسندگان
چکیده
The celebrated Green-Tao theorem states that the prime numbers contain arbitrarily long arithmetic progressions. We give an exposition of the proof, incorporating several simplifications that have been discovered since the original paper.
منابع مشابه
New Proofs of the Green–Tao–Ziegler Dense Model Theorem: An Exposition
Green, Tao and Ziegler [GT, TZ] prove “Dense Model Theorems” of the following form: if R is a (possibly very sparse) pseudorandom subset of set X , and D is a dense subset of R, then D may be modeled by a set M whose density inside X is approximately the same as the density of D in R. More generally, they show that a function that is majorized by a pseudorandom measure can be written as a sum o...
متن کاملThe Study of Variation of Photon Intensity Inside Biological Phantom by Green Theorem
The Image reconstruction is an important problem in optical tomography. The process of the image processing requires the study of photon migration in biological tissue. There are several approaches to study and simulate propagation of photons in biological tissues. These approaches are categorized into stochastic and analytical groups. The Monte Carlo method as a stochastic method is widely use...
متن کاملGreen-tao Theorem in Function Fields
We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite field, to show that for every k, the irreducible polynomials in Fq[t] contain configurations of the form {f + P g : deg(P) < k}, g = 0.
متن کاملGreen-tao Theorem in Function Fields
We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite fields, to show that for every k, the irreducible polynomials in Fq[t] contains configurations of the form {f + P g : deg(P) < k}, g = 0.
متن کاملThe Dichotomy between Structure and Randomness, Arithmetic Progressions, and the Primes
A famous theorem of Szemerédi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a fundamental dichotomy between structure and randomness, which in turn leads (roughly speaking) to a decomposition of any object into a structured (low-complexity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014